Intercausal Independence and Heterogeneous Factorization
نویسندگان
چکیده
It is well known that conditional indepen dence can be used to factorize a joint prob ability into a multiplication of conditional probabilities. This paper proposes a con structive definition of intercausal indepen dence, which can be used to further factorize a conditional probability. An inference algo rithm is developed, which makes use of both conditional independence and intercausal in dependence to reduce inference complexity in Bayesian networks.
منابع مشابه
Intercausal Reasoning with Uninstantiated Ancestor Nodes
Intercausal reasoning is a common inference pattern involving probabilistic dependence of causes of an observed common effect. The sign of this dependence is captured by a qual itative property called product synergy. The current definition of product synergy is insuf ficient for intercausal reasoning where there are additional uninstantiated causes of the common effect. We propose a new defi...
متن کاملExplaining 'Explaining Away'
Explaining away is a common pattern of reasoning in which the connrma-tion of one cause of an observed or believed event reduces the need to invoke alternative causes. The opposite of explaining away also can occur, in which the connrmation of one cause increases belief in another. We provide a general qualitative probabilistic analysis of intercausal reasoning, and identify the property of the...
متن کاملA simple approach to Bayesian network computations
The general problem of computing poste rior probabilities in Bayesian networks is NP hard Cooper However e cient algorithms are often possible for particular applications by exploiting problem struc tures It is well understood that the key to the materialization of such a possibil ity is to make use of conditional indepen dence and work with factorizations of joint probabilities rather than joi...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کامل$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994